Random regular graphs and the systole of a random surface
نویسندگان
چکیده
منابع مشابه
On the asymmetry of random regular graphs and random graphs
This paper studies the symmetry of random regular graphs and random graphs. Our main result shows that for all 3 ≤ d ≤ n − 4 the random d-regular graph on n vertices almost surely has no non-trivial automorphisms. This answers an open question of N. Wormald [13].
متن کاملLearning Random Regular Graphs
The family of random regular graphs is a classic topic in the realms of graph theory, combinatorics and computer science. In this paper we study the problem of learning random regular graphs from random paths. A random regular graph is generated uniformly at random and in a standard label-guided graph exploration setting, the edges incident from a node in the graph have distinct local labels. T...
متن کاملRandom strongly regular graphs?
Strongly regular graphs lie on the cusp between highly structured and unstructured. For example, there is a unique strongly regular graph with parameters (36,10,4,2), but there are 32548 non-isomorphic graphs with parameters (36,15,6,6). (The first assertion is a special case of a theorem of Shrikhande, while the second is the result of a computer search by McKay and Spence.) In the light of th...
متن کاملColouring Random Regular Graphs
In a previous paper we showed that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. Here we extend the method to show that a random 6-regular graph asymptotically almost surely (a.a.s.) has chromatic number 4 and that the chromatic number of a random d-regular graph for other d between 5 and 10 inclusive is a.a.s. restricted to a range of two integer values...
متن کاملMultiple Random Walks in Random Regular Graphs
We study properties of multiple random walks on a graph under various assumptions of interaction between the particles. To give precise results, we make the analysis for random regular graphs. The cover time of a random walk on a random r-regular graph was studied in [6], where it was shown with high probability (whp), that for r ≥ 3 the cover time is asymptotic to θrn lnn, where θr = (r − 1)/(...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Topology
سال: 2017
ISSN: 1753-8416
DOI: 10.1112/topo.12005